Equivalence Checking for Infinite Systems Using Parameterized Boolean Equation Systems
نویسندگان
چکیده
In this paper, we provide a transformation from the branching bisimulation problem for infinite, concurrent, data-intensive systems in linear process format, into solving Parameterized Boolean Equation Systems. We prove correctness, and illustrate the approach with an unbounded queue example. We also provide some adaptations to obtain similar transformations for weak bisimulation and simulation equivalence.
منابع مشابه
Solving conjunctive and disjunctive parameterized Boolean equation systems using SMT solvers
In this paper, we consider methods for solving model checking problems expressed as parameterized Boolean equation systems symbolically by making use of SMT solvers. By unrolling the PBES and expressing relevant properties of that unrolling as an SMT proposition, the solution to the model checking problem expressed by a PBES can be computed by an SMT solver. Based on this technique, we present ...
متن کاملVerification of reactive systems via instantiation of Parameterised Boolean Equation Systems
Verification problems for finiteand infinite-state processes, like model checking and equivalence checking, can effectively be encoded in Parameterised Boolean Equation Systems (PBESs). Solving the PBES then solves the encoded problem. The decidability of solving a PBES depends on the data sorts that occur in the PBES. We describe a pragmatic methodology for solving PBESs, viz., by attempting t...
متن کاملImproved On-the-Fly Equivalence Checking Using Boolean Equation Systems
Equivalence checking is a classical verification method for ensuring the compatibility of a finite-state concurrent system (protocol) with its desired external behaviour (service) by comparing their underlying labeled transition systems (Ltss) modulo an appropriate equivalence relation. The local (or on-the-fly) approach for equivalence checking combats state explosion by exploring the synchron...
متن کاملSolution Techniques for Boolean Equation Systems
The goal of this project is to study solution techniques for Boolean equation systems. Efficient solution methods for Boolean equation systems are developed, by combining specific solution techniques for important subclasses of equation systems. In particular, by employing techniques from [2, 5, 3, 4], a specific fixpoint analysis tool is constructed to solve general form Boolean equation syste...
متن کاملA Checker for Modal Formulae for Processes with Data
We propose an algorithm for the automatic verification of first-order modal μ-calculus formulae on infinite state, data-dependent processes. The use of boolean equation systems for solving the modelchecking problem in the finite case is well-studied. In this paper, we extend on this solution, such that we can deal with infinite state, data-dependent processes. We provide a transformation from t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007